On the Error Probability of General Trellis Codes with Applications to Sequential Decoding
نویسنده
چکیده
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = l/n is given which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence when M 2 T + [nEvu(R)]-’ log, L. The implication that the actual error probability behaves similarly is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication which can thus be taken as a design rule for choosing M so that the error probability is reduced to its minimum value for a given T.
منابع مشابه
On the error probability of general trellis codes with applications to sequential decoding (Corresp.)
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = l/n is given which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence when M 2 T + [nEvu(R)]-’ log, L. The implication that the actual...
متن کاملExact Pairwise Error Probability of Space-Time Codes under MAP Decoding with Applications
We study the maximum a posteriori (MAP) decoding of memoryless non-uniform sources over multiple-antenna channels. Our model is general enough to include spacetime coding, BLAST architectures, and single-transmit multi-receive antenna systems which employ maximal receive combining (MRC) and any kind of channel coding. We derive a closed-form single-letter expression for the codeword pairwise er...
متن کاملSequential Decoding of Convolutional Codes
This article surveys many variants of sequential decoding in literature. Rather than introducing them chronologically, this article first presents the Algorithm A, a general sequential search algorithm. The stack algorithm and the Fano algorithm are then described in details. Next, trellis variants of sequential decoding, including the recently proposed maximum-likelihood sequential decoding al...
متن کاملA Note on Performance of Generalized Tail Biting Trellis Codes
Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. Error exponents and decoding complexity for generalized tail biting (GTB) random trellis codes, and their relationships are derived, where the GTB trellis codes consist of full tail biting (FTB) trellis codes, partial tail biting (PTB) trellis codes and direct truncated (DT) trellis codes. We show...
متن کاملSoft-decision decoding using punctured codes
Let a -ary linear ( )-code be used over a memoryless channel. We design a soft-decision decoding algorithm that tries to locate a few most probable error patterns on a shorter length [ ]. First, we take cyclically consecutive positions starting from any initial point. Then we cut the subinterval of length into two parts and examine most plausible error patterns on either part. To obtain codewor...
متن کامل